package Euler81;

import java.io.*;
import java.util.*;

public class MinPathSum1 {
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new FileReader("minpath1.txt"));
		String line;
		while ((line = br.readLine()) != null) {
			String tokens[] = line.split(" ");
			String arr1[] = new String[5], arr2[] = new String[5];
			
			
		}
		
		
		
		br.close();
	}
}

/*public static void main(String args[])
{
    final int max = 10000;
    
    //Test the function.
    printIntegerArray(getMultiples(max));
}

//Get the multiples of 3, 7, and 12 up to max.
static int[] getMultiples(int max)
{
    //Use an arraylist so you don't have to constantly resize an array.
    List<Integer> nums = new ArrayList<Integer>();
    
    for(int i = 1; i <= max; i++)
    {
        //Since all multiple of 12 are also multiples of 3, there is no need to check for multiples of 12.
        if((i%3==0)||(i%7==0))
        {
            nums.add(i);
        }
    }
    
    return integerListToArray(nums);
}

static int[] integerListToArray(List<Integer> list)
{
    //Convert arraylist to array and return.
    int numArray[] = new int[list.size()];
    for(int i = 0; i < list.size(); i++)
    {
        numArray[i] = list.get(i);
    }
    
    return numArray;
}

static void printIntegerArray(int arr[])
{
    for(int i = 0; i < arr.length; i++)
    {
        if(i == arr.length-1)
        {
            System.out.print(arr[i]);
        }
        else
        {
            System.out.print(arr[i] + ", ");
        }
    }
}*/